home *** CD-ROM | disk | FTP | other *** search
Text File | 1991-03-06 | 1.5 KB | 47 lines | [TEXT/GEOL] |
- Item 5286183 18-Dec-90 10:38PST
-
- From: X0591 MacApp Dev Assoc, Howard Katz,IVC
-
- To: MACAPP.TECH$ MacApp Technical
-
- ------------------------------------------------------------------------------
-
- Sub: puzzle diversion for you
-
- Everybody,
-
- Seasons Greetings! Here’s a mindless little diversion that might add a
- little spice to your Holiday Season if such things amuse you. Thanks to Jim and
- Dave at Columbia Computing for passing this on. It DOESN’T require any
- calculus.
-
- We have two cities separated by a river. This is not in scale below, but
- the first city is 15 units from the river and the second city is 3 units from
- the river. The distance between the cities, projected along the river bank, is
- 24 units.
-
- • city 1
-
- 15
-
- ----+---------------
- <- 24 ->
- ----------------+---
- 3
- • city 2
-
- The problem is: Where to place a bridge to minimize the TOTAL travelled
- distance between the cities, assuming that the roads go in a straight line
- directly from the cities to the ends of the bridge, and the bridge (in normal
- bridge fashion) is perpendicular to the river bank. (This is hard to describe
- but obvious when drawn: one picture would be worth a 1000 words here. Link me
- if you want a quick SuperPaint dump of the setup.)
-
- Anyway, have fun,
-
- Howard
-
- P.S. I’m not on MacApp.Tech$ myself, so link any personal inquiries directly,
- please.
-
-